Formal explanations as logical derivations

نویسندگان

چکیده

According to a longstanding philosophical tradition dating back Aristotle, certain proofs do not only certify the truth of their conclusion but also explain it. Lately, much effort is being devoted logically characterise explanatory relation grounding, especially by proof-theoretical means. Nevertheless, no thorough investigation resulting notion formal explanation exists. We show that explanations can be seen as logical derivations particular kind and study interactions between grounding rules, derivations. define minimal calculus captures both derivability, normalisation procedure rules are proof-theoretically balanced with respect elimination rules. The introduced enables us combine explanations, distinguish parts from non-explanatory parts, compose in order construct chains consecutive steps.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Formal Grammars as Models of Logic Derivations

Context-free at t r ibute grammars are proposed as derivational models for proofs in the predicate calculus. The new representation is developed and i t s correspondence to resolution-based clause i n terconnectivity graphs is established. The new representation may be used to transform a predicate calculus characterization of a problem into a regular algebra characterization of the solutions. ...

متن کامل

Derivations as Proofs a Logical Approach to Minimalism

The purpose of this paper is to show that we can work in the spirit of minimalist grammars by means of a labelled commutative (and associative) calculus (Oehrle’s Mon:LP), enriched with constraints on the use of assumptions. Lexical entries are considered proper axioms, some of which are coupled with (sequences of) hypotheses which must necessarily be introduced and discharged before the use of...

متن کامل

Dynamic Derivations for Sequent-Based Logical Argumentation

We introduce a general approach for representing and reasoning with argumentation-based systems. In our framework arguments are represented by Gentzen-style sequents, attacks (conflicts) between arguments are represented by sequent elimination rules, and deductions are made by dynamic proof systems. This framework accommodates different languages and logics in which arguments may be represented...

متن کامل

Microscopic Reversibility and Macroscopic Behavior : Physical Explanations and Mathematical Derivations

The observed general time-asymmetric behavior of macroscopic systems—embodied in the second law of thermodynamics—arises naturally from time-symmetric microscopic laws due to the great disparity between macro and micro-scales. More specific features of macroscopic evolution depend on the nature of the microscopic dynamics. In particular, short range interactions with good mixing properties lead...

متن کامل

Infinite derivations as failures

When operating on cyclic data, programmers have to take care in assuring that their programs will terminate; in our opinion, this is a task for the interpreter. We present a Prolog meta-interpreter that checks for the presence of cyclic computations at runtime and returns a failure if this is the case, thus allowing inductive predicates to properly deal with cyclic terms.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Non-Classical Logics

سال: 2021

ISSN: ['1958-5780', '1166-3081']

DOI: https://doi.org/10.1080/11663081.2021.2010435